Compositionality for Presuppositions over Tableaux

نویسنده

  • Pablo Gervás
چکیده

Tableaux originate as a decision method for a logical language. They can also be extended to obtain a structure that spells out all the information in a set of sentences in terms of truth value assignments to atomic formulas that appear in them. This approach is pursued here. Over such a structure, compositional rules are provided for obtaining the presuppositions of a logical statement from its atomic subformulas and their presuppositions. The rules are based on classical logic semantics and they are shown to model the behaviour of presuppositions observed in natural language sentences built with if . . . then, and and or. The advantages of this method over existing frameworks for presuppositions are discussed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Incremental Construction of a Model of the Domain from a Set of Sentences by Means of Contextual Tableaux

During a dialogue, participants build up a model of the domain of predication. This model of the domain is used to interpret subsequent utterances. For instance, a mention of the man with the limp relies on locating such a man within the picture of the domain to be interpreted. Quantified constructions like every man in the room also rely on this picture of the domain to be interpreted correctl...

متن کامل

Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics

The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a mechanism for producing a classic-like description of them in terms of an effective variety of bivalent semantics; (ii) a mechanism for extracting, from the bival...

متن کامل

Computing Presuppositions by Contextual Reasoning

This paper describes how automated deduction methods for natural language processing can be applied more efficiently by encoding context in a more elaborate way. Our work is based on formal approaches to context, and we provide a tableau calculus for contextual reasoning. This is explained by considering an example from the problem area of presupposition projection.

متن کامل

Presupposition Accommodation in Update Semantics

The study of presuppositions lies on the border of semantics and pragmatics. It concerns information, assumed to be part of the discourse context by the speaker, as apparent in the syntactic form of the utterance. Missing presupposed information will normally be lled in by the hearer, provided it is compatible with the context. My thesis tries to characterise this process of presupposition acco...

متن کامل

Expressing discourse dynamics through continuations. (Expression de la dynamique du discours à l'aide de continuations)

This thesis develops a theoretical formalism of formal semantics of natural language in the spirit of Montague semantics. The developed framework satisfies the principle of compositionality in a simple and elegant way, by being as parsimonious as possible: completely new formalisms or extensions of existing formalisms with even more complex constructions to fit particular linguistic phenomena h...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره cmp-lg/9505014  شماره 

صفحات  -

تاریخ انتشار 1995